Reliable and Energy Efficient Target Coverage for Wireless Sensor Networks

A critical aspect of applications with Wireless Sensor Networks (WSNs) is network lifetime.Power-constrained WSNs are usable as long as they can communicate sense data to a processing node.Poor communication links and hazardous environments make the WSNs unreliable.Existing schemes assume that the state of a sensor covering targets is binary:success (covers the targets) or failure (cannot cover the targets).However,in real WSNs,a sensor covers targets with a certain probability.To improve WSNs’ reliability,we should consider that a sensor covers targets with users’ satisfied probability.To solve this problem,this paper first introduces a failure probability into the target coverage problem to improve and control the system reliability.Furthermore,we model the solution as the α-Reliable Maximum Sensor Covers (α-RMSC) problem and design a heuristic greedy algorithm that efficiently computes the maximal number of α-Reliable sensor covers.To efficiently extend the WSNs lifetime with users’ pre-defined failure probability requirements,only the sensors from the current active sensor cover are responsible for monitoring all targets,while all other sensors are in a low-energy sleep mode.Simulation results validate the performance of this algorithm,in which users can precisely control the system reliability without sacrificing much energy consumption.     

Multi-Axis Projection Based Giant Component Formation in Random Unit-Disk Graphs

This paper proposes a multi-axis projection (MAP) based giant component formation strategy via the Maximal Independent Set (MIS) in a random unit-disk graph.We focus on the problem of virtual back-bone construction in wireless ad hoc and sensor networks,where the coverage areas of the nodes are disks with identical radii.In the simulation,we show that the MAP-based giant component has the ability to connect most nodes and serves as a backbone in the network.The algorithm is localized and may play an important role in efficiently constructing a virtual backbone for ad hoc and sensor networks.     

A novel approach of hybrid genetic optimization with elite ant colony: Application in the modulation recognition

A novel approach (HGO-EAC) for hybrid genetic op-timization (GO) with elite ant colony (EAC) is proposed for the automatic modulation recognition of communication signals,through which we improve the basic ant colony algorithms by referencing elite strategy and present a new fusion strategy for genetic optimization and elite ant colony. This approach is used to train the neural networks as the classifier for modulation. Simula-tion results indicate good performance on an additive white Gaus-sian noise (AWGN) channel,with recognition rate reaching to 70% especially for CW even at signal-to-noise ratios as low as 5 dB. This approach can achieve a high recognition rate for the typical modulations such as CW,4ASK,4FSK,BPSK,and QAM16. Test result shows that it has better performance than BP algorithm and basic ant colony algorithms by achieving faster training and stronger robustness.     

基于复杂网络的上海证券交易所富人俱乐部特性研究

利用2009年在上海证券交易所股票数据建立股票之间的关联网络,分析表明该网络属于典型的稀疏型无标度网络,网络中存在较多的连接甚为紧密的Hub节点,它们影响着网络的传播动力学行为.然后采用分段线性拟合的方式找到了上海证券交易所的富人俱乐部,分析了Hub点集以及富人俱乐部对整体股市的影响,并且发现采用网络的观点可以诊断出股...     

应用邻接多重表存储结构的配电网可靠性评估算法

结合复杂配电网的特点,提出基于邻接多重表的复杂配电网可靠性评估分块算法。首先给出适合于配电网数据存储的邻接多重表构造方法及存储结构,解决了网络搜索的空间、时间复杂度问题。基于此提出配电网前推回代潮流计算方法及配电网可靠性评估的分块形成算法。该算法可使配电网潮流计算与可靠性评估分块算法采用同种存储结构,简化了配电网可靠性计算程序的编制,并可节省计算时间。应用该算法对RBTS-BUS6及实际工程系统进行了可靠性评估,算例表明该算法可有效减少计算时间,具有较高的工程实用价值。     

用逻辑方法验证移动Ad Hoc网络协议

针对移动Ad Hoc网络节点移动和无线广播通信特征,引入移动算子和广播算子,扩展形式逻辑LS2,提出了建模和分析移动Ad Hoc网络安全系统的逻辑ELS2.ELS2把网络模型化为不同位置上执行程序的线程复合,把攻击者模型化为与协议参与方并发运行的线程.ELS2中提出网络迹概念,描述网络节点内部计算和外部交互,以及节点移...     

多媒体传感器网络中被动目标定位算法

针对被动目标定位问题,提出了一种多视觉感知节点协同定位算法.与传统的视觉目标定位方法不同,该算法无需进行训练或特征识别,而是各个节点基于机器视觉理论,将目标投影为定位平面上的一条直线,并使用Hough变换将该直线映射为Hough空间中的一个离散点,最后对离散点进行正弦曲线拟合,拟合参数即为目标的最终位置估计.根据视觉感...     

基于AIC方法的切换神经网络模型设计

将切换系统设计中的切换思想与神经网络相结合,构建了切换神经网络模型.根据模糊C均值（FCM）聚类方法将样本数据分为多组训练数据,每组数据对应训练一个单一神经网络模型,再利用赤池信息准则（AIC）制定相应的切换规则.根据输入数据特性,选择单一网络或多网络组合的输出作为模型输出,从而达到函数逼近目的.本模型更好地利用了各个子网络在特定区域具有较高逼近精度的特点.仿真结果表明,切换神经网络模型有较高的逼近精度.     

无线传感器网络节点调度技术研究

探讨了无线传感器网络的节点硬件体系结构和网络体系结构;论证了无线传感器网络节点调度的必要性和价值;从网络覆盖度及连通性等角度分析了若干较有代表性的节点调度算法.     

无线传感器/执行器网络SA协作分簇算法

针对现有分簇算法大多没有考虑监控区域内事件发生频率和执行任务能耗的因素,导致无法适应无线传感器/执行器网络的特点,提出一种基于SA协作模型的分簇算法（CASA）.算法从全网的能耗和时延影响的角度,建立基于SA协作的能耗模型,综合考虑时延和连通度等约束条件,以网络能量优化为目标,构造非线性优化函数,利用KKT条件求解网络理想执行器节点个数和传感器节点传输半径等网络分簇所需参数,并在此基础上完成节点的部署和成簇.该算法通信开销较小,网络平均时延和能耗等仿真结果表明：相比典型算法,能够在满足一定连通度的前提下,优化网络部署,增强网络实时性和能量均衡性.